Homology gives size control in genetic programming
نویسندگان
چکیده
The Maximum Homologous Crossover attempts to preserve similar structures from parents by aligning them according to their homology. In this paper, it is successfully tested on the classical Even-N Parity Problem where it demonstrates interesting abilities in bloat reduction. Then, we show that this operator gives an accurate control of the size of programs during the evolution and thus, allows the development of new strategies for the search space exploration.
منابع مشابه
Modelface: an application programming interface (API) for homology modeling studies using Modeller software
An interactive application, Modelface, was presented for Modeller software based on windows platform. The application is able to run all steps of homology modeling including pdb to fasta generation, running clustal, model building and loop refinement. Other modules of modeler including energy calculation, energy minimization and the ability to make single point mutations in the PDB structures a...
متن کاملModelface: an application programming interface (API) for homology modeling studies using Modeller software
An interactive application, Modelface, was presented for Modeller software based on windows platform. The application is able to run all steps of homology modeling including pdb to fasta generation, running clustal, model building and loop refinement. Other modules of modeler including energy calculation, energy minimization and the ability to make single point mutations in the PDB structures a...
متن کاملSize Control with Maximum Homologous Crossover
Most of the Evolutionary Algorithms handling variable-sized structures, like Genetic Programming, tend to produce too long solutions and the recombination operator used is often considered to be partly responsible of this phenomenon, called bloat. The Maximum Homologous Crossover (MHC) preserves similar structures from parents by aligning them according to their homology. This operator has alre...
متن کاملA Method for Solving Optimal Control Problems Using Genetic Programming
This paper deals with a novel method for solving optimal control problems based on genetic programming. This approach produces some trial solutions and seeks the best of them. If the solution cannot be expressed in a closed analytical form then our method produces an approximation with a controlled level of accuracy. Using numerical examples, we will demonstrate how to use the results.
متن کاملSize Fair and Homologous Tree Genetic Programming Crossovers
Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program size and no detrimental e ect on GP performance. GP search spaces are partitioned by the ridge in the number of program v. their size and depth. A ramped uniform random initialisation is described which straddles the ridge. With...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003